Geometric Phase, Hannay's Angle, and an Exact Action Variable

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

EXACT SOLUTIONS OF NONSTATIONARY SHRÖDINGER EQUATIONS and GEOMETRIC PHASE

The procedure of solving nonstationary Schrödinger equations in the exact analytic form is elaborated on the basis of exactly solvable stationary models. The exact solutions are employed to study the nonadiabatic geometric phase at cyclic evolution of quantum systems.

متن کامل

Classification and properties of acyclic discrete phase-type distributions based on geometric and shifted geometric distributions

Acyclic phase-type distributions form a versatile model, serving as approximations to many probability distributions in various circumstances. They exhibit special properties and characteristics that usually make their applications attractive. Compared to acyclic continuous phase-type (ACPH) distributions, acyclic discrete phase-type (ADPH) distributions and their subclasses (ADPH family) have ...

متن کامل

Variable geometric-phase polarization rotators for the visible

We present the principles of variable pure polarization rotators based on the accumulation of a geometric phase that is obtained by coiling a beam of light via discrete reflections. They consist of two pseudo rotators in series. By changing the angle between the pseudo rotators the geometric phase acquired by the light is varied. We describe in detail two important examples: the variable-angle ...

متن کامل

Exact rounding for geometric

Exact rounding is provided for elementary oating-point arithmetic operations (e.g. in the IEEE standard). Many authors have felt that it should be provided for other operations, in particular for geometric constructions. We show how one may round modular representation of numbers to the closest f.p. rep-resentable number, and demonstrate how it can be applied to a variety of geometric construct...

متن کامل

Towards Exact Geometric Computation

Exact computation is assumed in most algorithms in computational geometry. In practice, implementors perform computation in some fixed-precision model, usually the machine floating-point arithmetic. Such implementations have many well-known problems, here informally called "robustness issues". To reconcile theory and practice, authors have suggested that theoretical algorithms ought to be redes...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review Letters

سال: 2000

ISSN: 0031-9007,1079-7114

DOI: 10.1103/physrevlett.85.1141